On the Structure of Rough Approximations
نویسنده
چکیده
We study rough approximations based on indiscernibility relations which are not necessarily reflexive, symmetric or transitive. For this, we define in a lattice-theoretical setting two maps which mimic the rough approximation operators and note that this setting is suitable also for other operators based on binary relations. Properties of the ordered sets of the upper and the lower approximations of the elements of an atomic Boolean lattice are studied.
منابع مشابه
Rough ideals based on ideal determined varieties
The paper is devoted to concern a relationship between rough set theory and universal algebra. Notions of lower and upper rough approximations on an algebraic structure induced by an ideal are introduced and some of their properties are studied. Also, notions of rough subalgebras and rough ideals with respect to an ideal of an algebraic structure, which is an extended notion of subalgebras and ...
متن کاملTopological structure on generalized approximation space related to n-arry relation
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
متن کاملThe Topological Structure of Approximation Operators on a CCD Lattice
Rough sets deal with the vagueness and granularity in information systems. Reference[3] discusses rough approximations on a complete completely distributive lattice(CCD lattice for short) and brings generalizations of rough sets into a unified framework. This paper is devoted to the discussion of the relationship between approximations and topologies on a CCD lattice. It is proved that the set ...
متن کاملEvidence-theory-based numerical characterization of multigranulation rough sets in incomplete information systems
Multigranulation rough sets are desirable features in the field of rough set, where this concept is approximated by multiple granular structures. In this study, we employ belief and plausibility functions from evidence theory to characterize the set approximations and attribute reductions in multigranulation rough set theory. First, we show that in an incomplete information system, the pessimis...
متن کاملStratified Rough Sets and Granular Computing
This paper examines granulation structures for stratified rough set approximations. With respect to different level of granulations, various approximations are obtained. Two special types of granulation structures are investigated. A nested sequence of granulations by equivalence relations leads to a nested sequence of rough set approximations. A hierarchical granulation, characterized by a spe...
متن کامل